Towards Computing a Gröbner Basis of a Polynomial Ideal over a Field by Using Matrix Triangularization
نویسنده
چکیده
We give first results of our investigation of the connection between Gröbner bases computation and Gaussian elimination. We show that for every input set F of polynomials a matrix of shifts of those polynomials exists such that by triangularizing this matrix we obtain a Gröbner basis of F .
منابع مشابه
Computing the Bell Number by Using Gröbner Bases
In this paper, we show that the Bell number B(n) counts the total number of zeros of certain polynomial set over the finite field F2. An alternative method for computing B(n) is presented by using Gröbner bases. The new method makes a theoretical contribution to discuss the partitions of [n] in Combinatorics by using Computer Algebra without considering the complexity. Given a zero of the polyn...
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملBorder Basis of an Ideal of Points and its Application in Experimental Design and Regression
In this paper, we consider the problem of computing the order ideal and the corresponding border basis for the vanishing ideal of a given finite set of points with multiplicity The ideal of points has different applications in science and engineering. In this paper, we focus on presenting some models related to a real experiment and show the role of our approach in providing good statistical p...
متن کاملWalking Through The Gröbner Fan
The Gröbner Walk is an algorithm that transforms a polynomial ideal’s Gröbner basis under one term order into a basis under another order. Although we could always directly compute such a basis using Buchberger’s algorithm, the Gröbner Walk is of special interest because, in many cases, it is much more efficient to convert a basis using this algorithm than to compute it directly. We first discu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011